/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: Hua YY
 * Date: 2024-11-05
 * Time: 18:50
 */
class Solution {
    public int findMin(int[] nums) {
        int left = 0 , n = nums.length , right = n-1;
        int tem = nums[n-1];
        while(left < right){
            int mid = left + (right - left)/2;
            if(nums[mid] <= nums[n-1]){
                right = mid;
            }else{
                left = mid + 1;
            }
        }
        return nums[left];
    }
}
public class Test7 {
}
